The computability of group constructions II
نویسندگان
چکیده
منابع مشابه
Polish Group Actions and Computability
Let G be a closed subgroup of S∞ and X be a Polish G-space with a countable basisA of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions.
متن کاملFrom truth to computability II
Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and “truth” is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logical operators standing for operations on such games. Within the ambitious pr...
متن کاملthe verbal constructions in azari (harzani dialect)
most of the verbal constructions of harzani dialect have got inflectional affixes. the majority of the constructions are made up vy adding a specific verbal affix to the verbal stem (infinitive without infinitive marker). only a few number of them is formed by adding a verbal affix to the past participle of the verb. there are specific rules for the formation of different verbal types. there is...
15 صفحه اولNotions of computability at higher types II
In Part I of this series of papers [Lon01a] we gave a historical survey of the study of notions of higher-type computability. In the present paper and its sequel [Lon01b], we undertake a more systematic exposition of notions of higher-type computability, showing how many of the existing ideas and results can be fitted into a coherent framework. In Part II we will restrict our attention to notio...
متن کاملOn Canonical Constructions. Ii.
In the second paper in this series [2; 3], it was demonstrated that under suitable topological conditions on a space 5 (which are in particular always satisfied for a manifold), the problem of reconstructing S from its group G of homeomorphism onto itself may be reduced to the problem of reconstructing the points of 5 from C7. If 5 can be reconstructed then every automorphism of G is inner, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1973
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700045469